Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f2(0, y) -> y
f2(x, 0) -> x
f2(i1(x), y) -> i1(x)
f2(f2(x, y), z) -> f2(x, f2(y, z))
f2(g2(x, y), z) -> g2(f2(x, z), f2(y, z))
f2(1, g2(x, y)) -> x
f2(2, g2(x, y)) -> y

Q is empty.


QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f2(0, y) -> y
f2(x, 0) -> x
f2(i1(x), y) -> i1(x)
f2(f2(x, y), z) -> f2(x, f2(y, z))
f2(g2(x, y), z) -> g2(f2(x, z), f2(y, z))
f2(1, g2(x, y)) -> x
f2(2, g2(x, y)) -> y

Q is empty.

Q DP problem:
The TRS P consists of the following rules:

F2(g2(x, y), z) -> F2(y, z)
F2(g2(x, y), z) -> F2(x, z)
F2(f2(x, y), z) -> F2(x, f2(y, z))
F2(f2(x, y), z) -> F2(y, z)

The TRS R consists of the following rules:

f2(0, y) -> y
f2(x, 0) -> x
f2(i1(x), y) -> i1(x)
f2(f2(x, y), z) -> f2(x, f2(y, z))
f2(g2(x, y), z) -> g2(f2(x, z), f2(y, z))
f2(1, g2(x, y)) -> x
f2(2, g2(x, y)) -> y

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP
      ↳ QDPAfsSolverProof

Q DP problem:
The TRS P consists of the following rules:

F2(g2(x, y), z) -> F2(y, z)
F2(g2(x, y), z) -> F2(x, z)
F2(f2(x, y), z) -> F2(x, f2(y, z))
F2(f2(x, y), z) -> F2(y, z)

The TRS R consists of the following rules:

f2(0, y) -> y
f2(x, 0) -> x
f2(i1(x), y) -> i1(x)
f2(f2(x, y), z) -> f2(x, f2(y, z))
f2(g2(x, y), z) -> g2(f2(x, z), f2(y, z))
f2(1, g2(x, y)) -> x
f2(2, g2(x, y)) -> y

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

F2(g2(x, y), z) -> F2(y, z)
F2(g2(x, y), z) -> F2(x, z)
F2(f2(x, y), z) -> F2(x, f2(y, z))
F2(f2(x, y), z) -> F2(y, z)
Used argument filtering: F2(x1, x2)  =  x1
g2(x1, x2)  =  g2(x1, x2)
f2(x1, x2)  =  f2(x1, x2)
0  =  0
i1(x1)  =  i
1  =  1
2  =  2
Used ordering: Quasi Precedence: f_2 > g_2


↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ QDPAfsSolverProof
QDP
          ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f2(0, y) -> y
f2(x, 0) -> x
f2(i1(x), y) -> i1(x)
f2(f2(x, y), z) -> f2(x, f2(y, z))
f2(g2(x, y), z) -> g2(f2(x, z), f2(y, z))
f2(1, g2(x, y)) -> x
f2(2, g2(x, y)) -> y

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.